The calculation of discriminating kernel based on viability kernel and reachability
نویسندگان
چکیده
We discuss the calculation of discriminating kernel for the discrete-time dynamic game and continuous-time dynamic game (namely differential game) using the viability kernel and reachable set. For the discrete-time dynamic game, we give an approximation of the viability kernel by the maximal reachable set. Then, based on the relationship between viability and discriminating kernels, we propose an algorithm of the discriminating kernel. For the differential game, we compute an underapproximation of the viability kernel by the backward reachable set from a closed target. Then, we put forward an algorithm of the discriminating kernel using the relationship of the discriminating and viability kernels. This means that the victory domain can be computed because it is computed by the discriminating kernel. The novelty is that we give two algorithms of the discriminating kernel for a dynamic game that contains two control variables, not one control variable as in differential inclusion.
منابع مشابه
Real-Time Control for Autonomous Racing Based on Viability Theory
In this paper we consider autonomous driving of miniature race cars. The viability kernel is used to efficiently generate finite look ahead trajectories that maximize progress while remaining recursively feasible with respect to static obstacles (e.g., stay inside the track). Together with a low level model predictive controller, this method makes real time autonomous racing possible. The viabi...
متن کاملLagrangian methods for approximating the viability kernel in high-dimensional systems
While a number of Lagrangian algorithms to approximate reachability in dozens or even hundreds of dimensions for systems with linear dynamics have recently appeared in the literature, no similarly scalable algorithms for approximating viable sets have been developed. In this paper we describe a connection between reachability and viability that enables us to compute the viability kernel using r...
متن کاملApproximate Viability using Quasi-Random Samples and a Neural Network Classifier
We propose a novel approach to the computational investigation of reachability properties for nonlinear control systems. Our goal is to combat the curse of dimensionality, by proposing a mesh-free algorithm to numerically approximate the viability kernel of a given compact set. Our algorithm is based on a non-smooth analysis characterization of the viability kernel. At its heart is a neural net...
متن کاملDiscrimination of time series based on kernel method
Classical methods in discrimination such as linear and quadratic do not have good efficiency in the case of nongaussian or nonlinear time series data. In nonparametric kernel discrimination in which the kernel estimators of likelihood functions are used instead of their real values has been shown to have good performance. The misclassification rate of kernel discrimination is usually less than ...
متن کاملObject Recognition based on Local Steering Kernel and SVM
The proposed method is to recognize objects based on application of Local Steering Kernels (LSK) as Descriptors to the image patches. In order to represent the local properties of the images, patch is to be extracted where the variations occur in an image. To find the interest point, Wavelet based Salient Point detector is used. Local Steering Kernel is then applied to the resultant pixels, in ...
متن کامل